New computations in the Monster
نویسنده
چکیده
We survey recent computational results concerning the Monster sporadic simple group. The main results are: progress towards a complete classification of the maximal subgroups, including showing that L2(27) is not a subgroup; showing that the 196882-dimensional module over GF (2) supports a quadratic form; a complete set of explicit conjugacy class representatives; small representations of most of the maximal subgroups; and a partial classification of the ‘nets’ (in the sense of Norton).
منابع مشابه
Explicit representations of maximal subgroups of the Monster
Most of the maximal subgroups of the Monster are now known, but in many cases they are hard to calculate in. We produce explicit ‘small’ representations of all the maximal subgroups which are not 2-local. The representations we construct are available on the World Wide Web at http://brauer.maths.qmul.ac.uk/Atlas/. 1 The maximal subgroups of the Monster By the work of several authors [13, 14, 17...
متن کاملAdding New Mathematical Functions and Statistical Distributions in WinBUGS
WinBUGS is one of the usual softwares in computational Bayesian statistics, which is used to fit Baysian models easily. Although this software has usual mathematical functions and statistical distributions as built in functions, sometimes it is necessary to include other functions and distributions in computations which is done by some tricks and indirectly. By using WinBUGS developmen...
متن کاملA new existence proof of the Monster by VOA theory
We use uniqueness of a VOA (vertex operator algebra) extension of (V + EE8) 3 to a Moonshine type VOA to give a new existence proof of a finite simple group of Monster type. The proof is relatively direct. Our methods depend on VOA representation theory and are free of many special calculations which traditionally occur in theory of the Monster.
متن کاملInternet Voting: a Monstrous Alliance between Democracy and Technology?
In this paper, we aim at finding a cultural explanation of the controversy around the introduction of electronic voting, especially Internet voting. In her PhD thesis, Martijntje Smits (2002b) argues that controversies surrounding the introduction of new technologies can often be explained in terms of a clash between cultural categories. Whereas traditional cultures may for example see twins as...
متن کاملIncompressible laminar flow computations by an upwind least-squares meshless method
In this paper, the laminar incompressible flow equations are solved by an upwind least-squares meshless method. Due to the difficulties in generating quality meshes, particularly in complex geometries, a meshless method is increasingly used as a new numerical tool. The meshless methods only use clouds of nodes to influence the domain of every node. Thus, they do not require the nodes to be conn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006